RRT-Plan: A Randomized Algorithm for STRIPS Planning
نویسندگان
چکیده
We propose a randomized STRIPS planning algorithm called RRT-Plan. This planner is inspired by the idea of Rapidly exploring Random Trees, a concept originally designed for use in continuous path planning problems. Issues that arise in the conversion of RRTs from continuous to discrete spaces are discussed, and several additional mechanisms are proposed to improve performance. Our experimental results indicate that RRT-Plan is competitive with the state of the art in STRIPS planning.
منابع مشابه
Unifying SAT-based and Graph-based Planning
The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst 1995). We show that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systematic solvers. For certain computationally challenging benchmark problems this unified approach outperfo...
متن کاملLimitations of and Extensions to Heuristic Search Planning
This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively. In the context of STRIPS, the primary focus is on the widely used relaxed plan heuristic (h+). A variety of cases are shown in whi...
متن کاملAn Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficient strategy for solving TP, which combines, in an innovative way, several well established and studied techniques in AI, OR and constraint programming. Our approach integrates graph planning (a well studied planning p...
متن کاملDecentralized Path Planning for Multiple Agents in Complex Environments using Rapidly-exploring Random Trees
This thesis presents a novel approach to address the challenge of planning paths for real-world multi-agent systems operating in complex environments. The technique developed, the Decentralized Multi-Agent Rapidly-exploring Random Tree (DMARRT) algorithm, is an extension of the CL-RRT algorithm to the multi-agent case, retaining its ability to plan quickly even with complex constraints. Moreove...
متن کاملA Probabilistic Analysis of Propositional STRIPS Planning
I present a probabilistic analysis of propositional STRIPS planning. The analysis considers two assumptions. One is that each possible precondition (likewise postcondition) of an operator is selected independently of other pre-and postconditions. The other is that each operator has a xed number of preconditions (likewise postconditions). Under both assumptions , I derive bounds for when it is h...
متن کامل